1989B - Substring and Subsequence - CodeForces Solution


bitmasks brute force dp graphs greedy hashing strings trees

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
	x,y=list(input()),list(input())
	ans=len(y)+len(x)
	for i in range(len(y)):
		t=len(x)+len(y)
		p1=i
		for j in range(len(x)):
			if x[j]==y[p1]:
				t-=1
				p1+=1
			if p1==len(y):
				break
		ans=min(t,ans)
	print(ans)


Comments

Submit
0 Comments
More Questions

1719B - Mathematical Circus
1719C - Fighting Tournament
1642A - Hard Way
285C - Building Permutation
1719E - Fibonacci Strings
1696C - Fishingprince Plays With Array
1085A - Right-Left Cipher
1508B - Almost Sorted
1690C - Restoring the Duration of Tasks
1055A - Metro
1036D - Vasya and Arrays
1139C - Edgy Trees
37A - Towers
353A - Domino
409H - A + B Strikes Back
1262A - Math Problem
158C - Cd and pwd commands
194A - Exams
1673B - A Perfectly Balanced String
1104B - Game with string
1169B - Pairs
1567D - Expression Evaluation Error
78A - Haiku
1287A - Angry Students
1428A - Box is Pull
234B - Reading
581B - Luxurious Houses
1481C - Fence Painting
935A - Fafa and his Company
22A - Second Order Statistics